Kneser Colorings of Uniform Hypergraphs
نویسندگان
چکیده
منابع مشابه
Kneser Colorings of Uniform Hypergraphs
For xed positive integers r, k and ` with ` < r, and an r-uniform hypergraph H, let κ(H, k, `) denote the number of k-colorings of the set of hyperedges of H for which any two hyperedges in the same color class intersect in at least ` vertices. Consider the function KC(n, r, k, `) = maxH∈Hn κ(H, k, `), where the maximum runs over the family Hn of all r-uniform hypergraphs on n vertices. In this...
متن کاملHypergraphs with many Kneser colorings
For fixed positive integers r, k and ` with 1 ≤ ` < r and an r-uniform hypergraph H, let κ(H, k, `) denote the number of k-colorings of the set of hyperedges of H for which any two hyperedges in the same color class intersect in at least ` elements. Consider the function KC(n, r, k, `) = maxH∈Hn κ(H, k, `), where the maximum runs over the family Hn of all r-uniform hypergraphs on n vertices. In...
متن کاملGreedy colorings of uniform hypergraphs
We give a very short proof of an Erdős conjecture that the number of edges in a non-2-colorable n-uniform hypergraph is at least f(n)2, where f(n) goes to infinity. Originally it was solved by József Beck in 1977, showing that f(n) at least c log n. With an ingenious recoloring idea he later proved that f(n) ≥ cn. Here we prove a weaker bound on f(n), namely f(n) ≥ cn. Instead of recoloring a r...
متن کاملEquitable two-colorings of uniform hypergraphs
An equitable two-coloring of a hypergraph H = (V, E) is a proper vertex two-coloring such that the cardinalities of color classes differ by at most one. In connection with property B problem Radhakrishnan and Srinivasan proved that if H is a k-uniform hypergraph with maximum vertex degree ∆(H) satisfying ∆(H) c 2 k−1 √ k ln k (1) for some absolute constant c > 0, then H is 2-colorable. By using...
متن کاملEquitable colorings of non-uniform simple hypergraphs
The paper is devoted to the combinatorial problem concerning equitable colorings of non-uniform simple hypergraphs. Let H = (V,E) be a hypergraph, a coloring with r colors of its vertex set V is called equitable if it is proper (i.e. none of the edges is monochromatic) and the cardinalities of the color classes differ by at most one. We show that if H is a simple hypergraph with minimum edge-ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2009
ISSN: 1571-0653
DOI: 10.1016/j.endm.2009.07.036